The conjunctive complexity of quadratic Boolean functions

JOURNAL ARTICLE published April 1991 in Theoretical Computer Science

Authors: Katja Lenz | Ingo Wegener

Boolean functions whose monotone complexity is of size n2log n

JOURNAL ARTICLE published November 1982 in Theoretical Computer Science

Authors: Ingo Wegener

Boolean functions whose monotone complexity is of size n2/log n

BOOK CHAPTER published in Lecture Notes in Computer Science

Authors: Ingo Wegener

On the complexity of slice functions

JOURNAL ARTICLE published 1985 in Theoretical Computer Science

Authors: Ingo Wegener

Graph driven BDDs — a new data structure for Boolean functions

JOURNAL ARTICLE published April 1995 in Theoretical Computer Science

Authors: Detlef Sieling | Ingo Wegener

More on the complexity of slice functions

JOURNAL ARTICLE published 1986 in Theoretical Computer Science

Authors: Ingo Wegener

Switching functions whose monotone complexity is nearly quadratic

JOURNAL ARTICLE published July 1979 in Theoretical Computer Science

Authors: Ingo Wegener

Certificate complexity of elementary symmetric Boolean functions

JOURNAL ARTICLE published November 2022 in Theoretical Computer Science

Authors: Jing Zhang | Yuan Li

Multiplicative complexity of vector valued Boolean functions

JOURNAL ARTICLE published April 2018 in Theoretical Computer Science

Research funded by Danish Council for Independent Research (DFF-1323-00247)

Authors: Joan Boyar | Magnus Gausdal Find

On the modulo degree complexity of Boolean functions

JOURNAL ARTICLE published May 2020 in Theoretical Computer Science

Research funded by National Natural Science Foundation of China (61433014,61502449,61602440) | Ministry of Science and Technology of the People's Republic of China (2016YFB1000201)

Authors: Qian Li | Xiaoming Sun

A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation

JOURNAL ARTICLE published October 2007 in Theoretical Computer Science

Authors: Thomas Jansen | Ingo Wegener

A 3n-lower bound on the network complexity of Boolean functions

JOURNAL ARTICLE published January 1980 in Theoretical Computer Science

Authors: C.P. Schnorr

On the parity complexity measures of Boolean functions

JOURNAL ARTICLE published June 2010 in Theoretical Computer Science

Authors: Zhiqiang Zhang | Yaoyun Shi

New bounds for energy complexity of Boolean functions

JOURNAL ARTICLE published December 2020 in Theoretical Computer Science

Authors: Krishnamoorthy Dinesh | Samir Otiv | Jayalal Sarma

On the planar monotone computation of boolean functions

JOURNAL ARTICLE published 1987 in Theoretical Computer Science

Authors: Meuring Beynon | John Buckle

A class of boolean functions with linear combinational complexity

JOURNAL ARTICLE published December 1975 in Theoretical Computer Science

Authors: L.H. Harper | W.N. Hsieh | J.E. Savage

Lower bounds to the complexity of symmetric Boolean functions

JOURNAL ARTICLE published August 1990 in Theoretical Computer Science

Authors: L. Babai | P. Pudlák | V. Rödl | E. Szemeredi

On the multiplicative complexity of Boolean functions over the basis (∧,⊕,1)

JOURNAL ARTICLE published March 2000 in Theoretical Computer Science

Authors: Joan Boyar | René Peralta | Denis Pochuev

On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions

JOURNAL ARTICLE published January 1995 in Theoretical Computer Science

Authors: Akito Sakurai

On the positive and the inversion complexity of Boolean functions

JOURNAL ARTICLE published 1993 in RAIRO - Theoretical Informatics and Applications

Authors: V. Dičiūnas